Analysis of a randomized rendezvous algorithm
نویسندگان
چکیده
In this paper we propose and analyze a randomized algorithm to get rendezvous between neighbours in an anonymous graph. We examine in particular the probability to obtain at least one rendezvous and the expected number of rendezvous. We study the rendezvous number distribution in the cases of chain graphs, rings, and complete graphs. The last part is devoted to the efficiency of the proposed algorithm. © 2003 Elsevier Science (USA). All rights reserved.
منابع مشابه
Mobile Agent Rendezvous in a Ring
In the rendezvous search problem, two mobile agents must move along the n nodes of a network so as to minimize the time required to meet or rendezvous. When the mobile agents are identical and the network is anonymous, however, the resulting symmetry can make the problem impossible to solve. Symmetry is typically broken by having the mobile agents run either a randomized algorithm or different ...
متن کاملOn the performance of randomized communication topologies for rendezvous control of multiple vehicles
In this paper we analyze randomized coordination control strategies for the rendezvous problem of multiple agents with unknown initial positions. The performance of these control strategies is measured in terms of three important metrics: average relative agents’ distance, total input energy consumption, and number of packets per unit time that each agent can receive from the other agents. By a...
متن کاملRevisiting the Performance of the Modular Clock Algorithm for Distributed Blind Rendezvous in Cognitive Radio Networks
We reexamine the modular clock algorithm for distributed blind rendezvous in cognitive radio networks. It proceeds in rounds. Each round consists of scanning twice a block of generated channels. The modular clock algorithm inspired the creation of the jump-stay rendezvous algorithm. It augments the modular clock with a stay-on-onechannel pattern. This enhancement guarantees rendezvous in one ro...
متن کاملPolynomial Deterministic Rendezvous in Arbitrary Graphs
The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach. Two mobile agents have to meet at some node of a connected graph. We study deterministic algorithms for this problem, assuming that agents have distinct identifiers and are located in nodes of an unknown anonymous connected graph. Startup times of the agents are arbitrarily decid...
متن کاملAUV Rendezvous Online Path Planning in a Highly Cluttered Undersea Environment Using Evolutionary Algorithms
In this study, a single autonomous underwater vehicle (AUV) aims to rendezvous with a submerged leader recovery vehicle through a cluttered and variable operating field. The rendezvous problem is transformed into a nonlinear optimal control problem (NOCP) and then numerical solutions are provided. A penalty function method is utilized to combine the boundary conditions, vehicular and environmen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Comput.
دوره 184 شماره
صفحات -
تاریخ انتشار 2003